Algebraic Structures for Bipolar Constraint-Based Reasoning
نویسندگان
چکیده
The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of evaluation of decisions are often bipolar. The aim of this paper is to provide algebraic structures for the representation of bipolar rules, in the spirit of the algebraic approaches of constraint satisfaction. The structures presented here are general enough to encompass a large variety of rules from the bipolar literature, as well as having appropriate algebraic properties to allow the use of CSP algorithms such as forward-checking and algorithms based on variable elimination.
منابع مشابه
Fuzzy and Bipolar Mathematical Morphology, Applications in Spatial Reasoning
Mathematical morphology is based on the algebraic framework of complete lattices and adjunctions, which endows it with strong properties and allows for multiple extensions. In particular, extensions to fuzzy sets of the main morphological operators, such as dilation and erosion, can be done while preserving all properties of these operators. Another, more recent, extension, concerns bipolar fuz...
متن کاملReasoning of Geometric Concepts based on Algebraic Constraint-directed Method
We present an algebraic approach to geometric reasoning and learning. The purpose of this research is to avoid the usual difficulties in symbolic handling of geometric concepts. Our system GREW is grounded on a reasoning scheme that integrate the symbolic reasoning and algebraic reasoning of Wu's method. The basic principle of this scheme is to describe mathematical knowledge in terms of symbol...
متن کاملEncoding Relative Orientation and Mereotopology Relations with Geometric Constraints in CLP(QS)
One approach for encoding the semantics of spatial relations within a declarative programming framework is by systems of polynomial constraints. However, solving such constraints is computationally intractable in general (i.e. the theory of realclosed fields), and thus far the proposed symbolic algebraic methods do not scale to real world problems. In this paper we address this intractability b...
متن کاملCase-Based Algebraic Constraint System for Engineering Design
In this paper, we present an approach to solve design problems using different reasoning techniques. First, casebased reasoning was used in the design problem structuring phase to get the initial design of the device by retrieving similar existing designs. Then we adapting the initial design by using algebraic constraint propagation techniques, qualitative methods and interval arithmetic to sol...
متن کاملSEQUENTIAL PENALTY HANDLING TECHNIQUES FOR SIZING DESIGN OF PIN-JOINTED STRUCTURES BY OBSERVER-TEACHER-LEARNER-BASED OPTIMIZATION
Despite comprehensive literature works on developing fitness-based optimization algorithms, their performance is yet challenged by constraint handling in various engineering tasks. The present study, concerns the widely-used external penalty technique for sizing design of pin-jointed structures. Observer-teacher-learner-based optimization is employed here since previously addressed by a number ...
متن کامل